A Tool for Testing Data Type Implementations from Maude Algebraic Specifications
نویسندگان
چکیده
منابع مشابه
A Tool for Testing Data Type Implementations from Maude Algebraic Specifications
This paper presents a tool for testing data types implemented in C++ against formal specifications written in Maude. Maude is a formal specification language based on rewriting logic that allows the specification of abstract data types in a clear and concise manner. Moreover, Maude specifications are executable, which provides two advantages: firstly, we can test our specifications and, secondl...
متن کاملTesting Data Types Implementations from Algebraic Specifications
Algebraic specifications of data types provide a natural basis for testing data types implementations. In this framework, the conformance relation is based on the satisfaction of axioms. This makes it possible to formally state the fundamental concepts of testing: exhaustive test set, testability hypotheses, oracle. Various criteria for selecting finite test sets have been proposed. They depend...
متن کاملTesting Java implementations of algebraic specifications
In this paper we focus on exploiting a specification and the structures that satisfy it, to obtain a means of comparing implemented and expected behaviours and find the origin of faults in implementations. We present an approach to the creation of tests that are based on those specification-compliant structures, and to the interpretation of those tests’ results leading to the discovery of the m...
متن کاملFrom Maude Specifications to SOAP Distributed Implementations: A Smooth Transition
In this paper we show how the formal specification of a system written in Maude can be easily connected to its Web-based distributed implementation using SOAP. In addition to the usual advantages provided by the use of formal specifications, by allowing objects in any of these worlds (specification and implementation) to seamlessly interoperate we can obtain several interesting advantages, such...
متن کاملTesting deterministic implementations from nondeterministic FSM specifications
In this paper, conformance testing of protocols specified as nondeterministic finite state machines is considered. Protocol implementations are assumed to be deterministic. In this testing scenario, the conformance relation becomes a preorder, so-called reduction relation between FSMs. The reduction relation requires that an implementation machine produces a (sub)set of output sequences that ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2012
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2011.12.006